Integration of Interactive and Automatic Provers
نویسنده
چکیده
Interactive and resolution based automatic provers have both been used widely. Interactive provers offer users expressive formalisms and flexibility and are suitable for proving theorems of any user defined logics. However, they provide limited automation. In comparison, resolution based automatic provers provide automation, but only allow first order logic with equality. I am investigating combining the two types of provers through integrating an interactive prover Isabelle and a resolution based automatic prover Vampire. This paper gives an overview of the integration and describes the techniques used in it. It also lists some experimental results.
منابع مشابه
The integration of higher order interactive proof with first order automatic theorem proving
Interactive and automatic theorem proving are the two most widely used computerassisted theorem proving methods. Interactive proof tools such as HOL, Isabelle and PVS have been highly successful. They support expressive formalisms and have been used for verifying hardware, software, protocols, and so forth. Unfortunately interactive proof requires much effort from a skilled user. Many other too...
متن کاملAutomation for Interactive Proof Final Report
The idea of supporting interactive provers using automatic ones is an old one. An important early effort is the KIV system [1], which has been integrated with 3TAP. Hurd has integrated HOL4 with Gandalf [3], while Bezem et al. have integrated Coq with Bliksem [2]. None of these integrations appear to be used any more, and indeed none of their automatic theorem provers appear to be undergoing de...
متن کاملTranslating Higher-Order Problems to First-Order Clauses
Proofs involving large specifications are typically carried out through interactive provers that use higher-order logic. A promising approach to improve the automation of interactive provers is by integrating them with automatic provers, which are usually based on first-order logic. Consequently, it is necessary to translate higher-order logic formulae to first-order form. This translation shou...
متن کاملA Survey of Axiom Selection as a Machine Learning Problem
Automatic theorem provers struggle to discharge proof obligations of interactive theorem provers. This is partly due to the large number of background facts that are passed to the automatic provers as axioms. Axiom selection algorithms predict the relevance of facts, thereby helping to reduce the search space of automatic provers. This paper presents an introduction to axiom selection as a mach...
متن کاملTowards the Integration of an Intuitionistic First-Order Prover into Coq
Sledgehammer [11] and HOLyHammer [5] drastically improved the productivity for users of proof assistants. They make the capabilities of automated theorem provers (ATPs) available from within interactive proof assistants. The large, monolithic design of state-of-the-art theorem provers can not be easily trusted to be free of bugs. Thus invoking theorem provers as an oracle is unacceptable for mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003